-
1 WGMP
1) Сельское хозяйство: Western Grain Marketing Panel2) Математика: Weighted Graph Matching Problem3) Общественная организация: Working Group on Mine Problems (landmines) -
2 method
метод; процедура; способ- antithetic variate method - average ordinate method - average range method - binary search method - conjugate directions method - conjugate gradient method - control chart method - conventional milling method - correlation function method - decision function method - differential control method - Feynman diagram method - first approximation method - gradient projection method - iterative method - large sample method - large sieve method - least-squares regression method - less than fully efficient method - linearly implicit method - method of adjoint gradient - method of algebraic addition - method of alternating directions - method of balanced blocks - method of complex numbers - method of confidence intervals - method of conformal mappings - method of conjugate directions - method of conjugate gradients - method of cyclic descent - method of detached coefficients - method of disjunction of cases - method of divided differences - method of electrical images - method of elimination of quantifiers - method of empty ball - method of extreme values - method of false position - method of feasible directions - method of finite differences - method of first approximation - method of first entrance - method of fitting constants - method of fixed points - method of full enumeration - method of generating functions - method of geometric exhaustion - method of indefinite coefficients - method of infinite descent - method of interval bisection - method of least absolute values - method of least distance - method of least likelihood - method of maximum likelihood - method of means and standard deviations - method of medians and extreme values - method of minimal change - method of minimal variance - method of mirror reflections - method of moving frame - method of multiple comparison - method of orthogonal projections - method of paired associates - method of paired comparisons - method of phase integrals - method of projecting cones - method of proportional parts - method of rotating factors - method of semantic tableaux - method of separation of variables - method of simulaneous displacements - method of stationary phase - method of statistical differentials - method of statistical inference - method of steep variations - method of steepest ascent - method of stochastic approximation - method of straightforward iteration - method of successive displacements - method of successive divisions - method of successive elimination - method of transfinite induction - method of unweighted means - method of variable differences - method of variation of parameters - method of weighted residuals - optimum method - parallel tangents method - precision method - random walk method - recursive method - reduced gradient method - reflected wave method - relative method of measurement - sampling method by variables - statistical sampling method - steepest descent method - time average method -
3 search
1) поиск || искать; осуществлять поиск || поисковый3) исследование; изучение || исследовать; изучать•- search in state space
- admissible search
- area search
- automated search
- automatic search
- automatic program search
- backtracking search
- beam search
- best-first search
- binary search
- bisection search
- blind search
- Boolean search
- branch-and-bound search - brute force search
- case-insensitive search
- case-sensitive search
- catalog search
- chaining search
- chapter search
- Charalambous' search
- conjunctive search
- content-addressable search
- contextual search
- database search
- depth-first search
- dichotomizing search
- directory search
- disjunctive search
- exhaustive search of memory
- eyeball search
- fast search
- Fibonacci search
- Fibonacci numbers search
- file search
- fixed-format search
- folder search
- frequency-agile search
- geometrical search
- golden section search
- graph search
- hash search
- heuristic search
- holographic information search
- hybrid bisection-cubic search
- indexed search
- key search
- keyword search
- limit-type search
- linear search
- logarithmic search
- multiple-string search
- optimum tree search
- ordered search
- parallel search
- patent search
- pattern matching search
- proximity search
- quadratic quotient search
- quantum search
- radar search
- random search
- reconnaissance search
- self-terminating search
- semantic search
- sequential search
- sequential tree search
- serial search
- skip search
- stepped search
- straightforward search
- tree search
- variable search by value
- weighted search
- word search -
4 search
1) поиск || искать; осуществлять поиск || поисковый2) вчт. команда или программа поиска3) исследование; изучение || исследовать; изучать•- area search
- automated search
- automatic program search
- automatic search
- backtracking search
- beam search
- best-first search
- binary search
- bisection search
- blind search
- Boolean search
- branch-and-bound search
- breadth-first search
- Brent's search
- brute force search
- case-insensitive search
- case-sensitive search
- catalog search
- chaining search
- chapter search
- Charalambous' search
- conjunctive search
- content-addressable search
- contextual search
- database search
- depth-first search
- dichotomizing search
- directory search
- disjunctive search
- exhaustive search of memory
- eyeball search
- fast search
- Fibonacci numbers search
- Fibonacci search
- file search
- fixed-format search
- folder search
- frequency-agile search
- geometrical search
- golden section search
- graph search
- hash search
- heuristic search
- holographic information search
- hybrid bisection-cubic search
- indexed search
- key search
- keyword search
- limit-type search
- linear search
- logarithmic search
- multiple-string search
- optimum tree search
- ordered search
- parallel search
- patent search
- pattern matching search
- proximity search
- quadratic quotient search
- quantum search
- radar search
- random search
- reconnaissance search
- search for extraterrestrial intelligence
- search in problem space
- search in state space
- self-terminating search
- semantic search
- sequential search
- sequential tree search
- serial search
- skip search
- stepped search
- straightforward search
- tree search
- variable search by value
- weighted search
- word searchThe New English-Russian Dictionary of Radio-electronics > search
См. также в других словарях:
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Graph partition — The graph partitioning problem in mathematics consists of dividing a graph into pieces, such that the pieces are of about the same size and there are few connections between the pieces.Consider a graph G(V,E), where V denotes the set of vertices… … Wikipedia
Globales Matching — bezeichnet im Rahmen der Informationsintegration einen Prozess zur automatischen Abbildung verschiedener Schemas aufeinander (Schema Matching). Dabei werden Ergebnisse aus verschiedenen Matching Verfahren verwendet, um Attribute der zu matchenden … Deutsch Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Stable marriage problem — In mathematics, the stable marriage problem (SMP) is the problem of finding a stable matching mdash; a matching in which no element of the first matched set prefers an element of the second matched set that also prefers the first element.It is… … Wikipedia
Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and … Wikipedia
Skew-symmetric graph — In graph theory, a branch of mathematics, a skew symmetric graph is a directed graph that is isomorphic to its own transpose graph, the graph formed by reversing all of its edges. The isomorphism is required to be an involution without any fixed… … Wikipedia
Line graph — This article is about the mathematical concept. For statistical presentation method, see line chart. In graph theory, the line graph L(G) of undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name… … Wikipedia
Route inspection problem — In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph. When the graph has an… … Wikipedia
Assignment problem — The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics. It consists of finding a maximum weight matching in a weighted bipartite graph. In its most… … Wikipedia